STATIONARY CODING OF PROCESSES = CODAGE STATIONNAIRE DE PROCESSUSSHIELDS PC.1979; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1979; VOL. 25; NO 3; PP. 283-291; BIBL. 21 REF.Article

CHANNELS WITH ALMOST FINITE MEMORY = VOIES A MEMOIRE PRESQUE FINIENEUHOFF DL; SHIELDS PC.1979; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1979; VOL. 25; NO 4; PP. 440-447; BIBL. 10 REF.Article

THE MAXIMUM MUTUAL INFORMATION BETWEEN TWO RANDOM PROCESSES.GRAY RM; SHIELDS PC.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 33; NO 4; PP. 273-280; BIBL. 13 REF.Article

CHANNEL ENTROPY AND PRIMITIVE APPROXIMATIONNEUHOFF DL; SHIELDS PC.1982; ANN. PROBAB.; ISSN 0091-1798; USA; DA. 1982; VOL. 10; NO 1; PP. 188-198; BIBL. 5 REF.Article

BLOCK AND SLIDING-BLOCK SOURCE CODING.SHIELDS PC; NEUHOFF DL.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 2; PP. 211-215; BIBL. 22 REF.Article

FIXED-RATE UNIVERSAL CODES FOR MARKOV SOURCESNEUHOFF DL; SHIELDS PC.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 3; PP. 360-367; BIBL. 8 REF.Article

A MIXING T FOR WHICH T-T^-1 IS BERNOULLIBURTON RM; SHIELDS PC.1983; MONATSHEFTE FUER MATHEMATIK; ISSN 0026-9255; AUT; DA. 1983; VOL. 95; NO 2; PP. 89-98; BIBL. 8 REF.Article